On the Instructions of SCM 1 Artur Korniłowicz University of Białystok
نویسنده
چکیده
The articles [15], [8], [9], [10], [14], [11], [18], [2], [4], [6], [7], [5], [16], [1], [3], [19], [20], [12], [17], and [13] provide the notation and terminology for this paper. For simplicity, we adopt the following rules: a, b are data-locations, i1, i2, i3 are instruction-locations of SCM, s1, s2 are states of SCM, T is an instruction type of SCM, and k is a natural number. We now state a number of propositions: (1) a / ∈ the instruction locations of SCM. (2) Data-LocSCM 6= the instruction locations of SCM. (3) For every object o of SCM holds o = ICSCM or o ∈ the instruction locations of SCM or o is a data-location. (4) If i2 6= i3, then Next(i2) 6= Next(i3). (5) If s1 and s2 are equal outside the instruction locations of SCM, then s1(a) = s2(a). (6) Let N be a set with non empty elements, S be a realistic IC-Ins-separated definite non empty non void AMI over N , t, u be states of S, i1 be an instruction-location of S, e be an element of ObjectKind(ICS), and I be an element of ObjectKind(i1). If e = i1 and u = t+·[ICS 7−→ e, i1 7−→ I], then u(i1) = I and ICu = i1 and ICFollowing(u) = (Exec(u(ICu), u))(ICS). (7) AddressPart(haltSCM) = ∅. (8) AddressPart(a:=b) = 〈a, b〉. (9) AddressPart(AddTo(a, b)) = 〈a, b〉. (10) AddressPart(SubFrom(a, b)) = 〈a, b〉. (11) AddressPart(MultBy(a, b)) = 〈a, b〉.
منابع مشابه
Białystok Gauges and Cages . Part II 1 Artur Korniłowicz University of Białystok Robert Milewski University of Białystok
Let m be an even integer. Note that m + 2 is even. Let m be an odd integer. Observe that m + 2 is odd. Let m be a non empty natural number. Observe that 2 is even. Let n be an even natural number and let m be a non empty natural number. Note that n is even. We now state several propositions: (2) If r 6= 0, then 1 r · ri+1 = r. (3) If r s is an integer and s 6= 0, then −⌊ r s ⌋ = ⌊ s ⌋ + 1. (4) ...
متن کاملOn the Instructions of SCM1
The articles [17], [23], [18], [14], [24], [7], [8], [2], [3], [19], [22], [1], [9], [5], [10], [15], [4], [6], [12], [13], [20], [16], [21], and [11] provide the notation and terminology for this paper. For simplicity, we follow the rules: a, b denote data-locations, i1, i2, i3 denote instructionlocations of SCM, s1, s2 denote states of SCM, T denotes an instruction type of SCM, and k denotes ...
متن کاملFundamental Theorem of Arithmetic 1 Artur Korniłowicz University of Białystok Piotr Rudnicki University of Alberta Edmonton
We follow the rules: a, b, n denote natural numbers, r denotes a real number, and f denotes a finite sequence of elements of R. Let X be an empty set. Observe that cardX is empty. One can check that every binary relation which is natural-yielding is also real-yielding. Let us mention that there exists a finite sequence which is natural-yielding. Let a be a non empty natural number and let b be ...
متن کاملA Proof of the Jordan Curve Theorem via the Brouwer Fixed Point Theorem
The aim of the paper is to report on MIZAR codification of the Jordan curve theorem, a theorem chosen as a challenge to be completely verified using formal methods at the time when they started being commonly used. Formalization was done based on proofs taken from the literature, where theorems mentioned in the title of the paper from ”Brouwer’s Fixed Point Theorem and the Jordan Curve Theorem”...
متن کاملThe Basic Properties of SCM over Ring
In this paper I is an element of Z8, S is a non empty 1-sorted structure, t is an element of the carrier of S, and x is a set. Let R be a good ring. The functor SCM(R) yields a strict AMI over {the carrier of R} and is defined by the conditions (Def. 1). (Def. 1)(i) The objects of SCM(R) = N, (ii) the instruction counter of SCM(R) = 0, (iii) the instruction locations of SCM(R) = Instr-LocSCM, (...
متن کامل